A Matrix Iterative Method for Modal Sensitivity Analysis

نویسندگان

  • Ling-mi Zhang
  • Bai-qing He
چکیده

A matrix iterative method is developed for modal sensitivify analysis of structures, which can be utilized ,a both distinct and repeated eigenvalue cases. The novel method needs only firs: order derivatives of the system motrices in the repeated e;genvalue case, and is easy to be implemented. A matrix iterative algorithm is presented based on the existence and uniqueness of the governing equations for eigmvector sensitivities computation with multiple e;genvalues. Preand post-error-estimation formulas m-e derived based on the convergence of the iteration algorithm. Computer simulations using a symmetrical cantilever beam and a 3-D FRAME structure with distinct, repeated and closed eigenvalues are conducted to show the effectiveness and accuracy of the proposed new modal sensitivity analysir method. NOMENCLATURE M,K : mass and stiffness matrices h : eigenvalue VA : eigenvectorlmode shape Y’,@ : eigenvector (mode shape) matrix N : number of DOFs in the FE model 1 : number of multiplicity of eigenvalues i,k : integer E : small positive number

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition

Non-negative Matrix Factorization (NMF) is a part-based image representation method. It comes from the intuitive idea that entire face image can be constructed by combining several parts. In this paper, we propose a framework for face recognition by finding localized, part-based representations, denoted “Iterative weighted non-smooth non-negative matrix factorization” (IWNS-NMF). A new cost fun...

متن کامل

ارزیابی یک الگوریتم استخراج مشخصه جهت عیب‌یابی سازه جکتی فراساحلی با استفاده از مدل فیزیکی و بروزرسانی مدل المان محدود

One of the most important items in the field of engineering and design of structures is safety assessment. It is usually complicated, due to uncertainty in determining the most important parameters in the final design. This paper describes a new method for updating stiffness matrix structure that is capable of identifying the damage to individual members, when limited modal data is available by...

متن کامل

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

Comparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems

Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...

متن کامل

Finding the polar decomposition of a matrix by an efficient iterative method

Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002